Relaxations of Quadratic Programs in Operator Theory and System Analysis
نویسنده
چکیده
The paper describes a class of mathematical problems at an intersection of operator theory and combinatorics, and discusses their application in complex system analysis. The main object of study is duality gap bounds in quadratic programming which deals with problems of maximizing quadratic functionals subject to quadratic constraints. Such optimization is known to be universal, in the sense that many computationally hard questions can be reduced to quadratic programming. On the other hand, it is conjectured that an efficient algorithm of solving general non-convex quadratic programs exactly does not exist. A specific technique of ”relaxation”, which essentially replaces deterministic decision parameters by random variables, is known experimentally to yield high quality approximate solutions in some non-convex quadratic programs arising in engineering applications. However, proving good error bounds for a particular relaxation scheme is usually a challenging mathematical problem. In this paper relaxation techniques of dynamical system analysis will be described. It will be shown how operator theoretic methods can be used to give error bounds for these techniques or to provide counterexamples. On the other hand, it will be demonstrated that some difficult problems of operator theory have equivalent formulations in terms of relaxation bounds in quadratic programming, and can be approached using the insights from combinatorics and system theory.
منابع مشابه
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
Several types of relaxations for binary quadratic polynomial programs can be obtained using linear, secondorder cone, or semidefinite techniques. In this paper, we propose a general framework to construct conic relaxations for binary quadratic polynomial programs based on polynomial programming. Using our framework, we re-derive previous relaxation schemes and provide new ones. In particular, w...
متن کاملConvex quadratic relaxations for mixed-integer nonlinear programs in power systems
Abstract This paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimality guarantees. The new relaxations offer computational efficiency along with minimal optimality gaps, providing an in...
متن کاملA Recipe for Semide nite Relaxation for ( 0 , 1 ) - Quadratic
We review various relaxations of (0,1)-quadratic programming problems. These include semideenite programs, parametric trust region problems and concave quadratic maximiza-tion. All relaxations that we consider lead to eeciently solvable problems. The main contributions of the paper are the following. Using Lagrangian duality, we prove equivalence of the relaxations in a uniied and simple way. S...
متن کاملApplication of measures of noncompactness to infinite system of linear equations in sequence spaces
G. Darbo [Rend. Sem. Math. Univ. Padova, 24 (1955) 84--92] used the measure of noncompactness to investigate operators whose properties can be characterized as being intermediate between those of contraction and compact operators. In this paper, we apply the Darbo's fixed point theorem for solving infinite system of linear equations in some sequence spaces.
متن کامل